package 链表与双指针.m03.d13.t01;

import java.util.Scanner;

public class Main {
    private static final int MAXN = 100005;
    private static int[] divisorCount = new int[MAXN];

    public static void preprocess() {
        for (int i = 1; i < MAXN; ++i) {
            divisorCount[i] = 1;
        }
        for (int i = 2; i < MAXN; ++i) {
            if (divisorCount[i] == 1) { // i 是质数
                for (int j = i; j < MAXN; j += i) {
                    int temp = j;
                    int exp = 0;
                    while (temp % i == 0) {
                        temp /= i;
                        exp++;
                    }
                    divisorCount[j] *= (exp + 1);
                }
            }
        }
    }

    public static void main(String[] args) {
        preprocess();

        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();
        int maxx = 0;
        for (int i = a; i <= b; ++i) {
            maxx = Math.max(maxx, divisorCount[i]);
        }
        System.out.println(maxx);
        scanner.close();
    }
}